A Simple Algorithm for Increased Helical Pitch in Cone-Beam CT
نویسندگان
چکیده
A goal of cone-beam CT is to decrease the scan time needed to image a volume of the patient. Four things are required to meet this goal: (1) a detector with multiple rows of sensors, (2) higher bandwidth data acquisition system and image processor to handle the increased data rates and need for fast reconstruction, (3) high helical pitch, (4) a practical reconstruction algorithm that lends itself to fast reconstruction times. Within the last several years, CTsystems with first two, then four row detector arrays have been introduced to the marketplace [1]-[5]. The four row arrays are actually combinations of finer pitched detectors. Table I gives a comparison of the detector designs for the Toshiba Aquilion Multi, the LightSpeed QX/i from General Electric Medical Systems, the Siemens Volume Zoom and Marconi Mx8000. All the major manufacturers have announced plans for an output of 8 and/or 16 slices, which requires a new or modified detector design from Siemens and Marconi. Toshiba has presented images taken on a 256row prototype detector array [6], [7]. Thus, detector development for wider cone-angles is underway and will lead to faster scan times. The manufacturers are working on the second requirement as computer electronics improve. This presentation looks at the last two requirements. We present a scheme for high helical pitch while maintaining a practical although approximate reconstruction algorithm.
منابع مشابه
PI-line-based image reconstruction in helical cone-beam computed tomography with a variable pitch.
Current applications of helical cone-beam computed tomography (CT) involve primarily a constant pitch where the translating speed of the table and the rotation speed of the source-detector remain constant. However, situations do exist where it may be more desirable to use a helical scan with a variable translating speed of the table, leading a variable pitch. One of such applications could aris...
متن کاملSimple Quasi-Exact Filtered Backprojection Algorithms for Long-Object Problem in Helical Cone-Beam Tomography
Since the development of multi-slice helical CT, cone-beam reconstruction with a helical vertex path is receiving increasing attention. The current multi-slice CT scanners are adopting a class of approximate reconstruction algorithms which can be viewed an extension of the 2-D FBP algorithm. However, these approximate algorithms break down as the pitch of helix becomes large. In fact, major com...
متن کاملThe PI-methods for Helical Cone-Beam Tomography
Next generation helical cone-beam CT will feature pitches around 80 mm. It is predicted that reconstruction algorithms to be used in these machines with still rather modest cone angles may not necessarily be exact, but rather have an emphasis on simplicity and speed. The PI-methods are a family of algorithms, all of which are based on complete data capture with a detector collimated to the Tam-...
متن کاملGuest Editorial - Multirow Detector and Cone-Beam Spiral/Helical CT
S PIRAL/HELICAL multirow detector computed tomog-raphy (MDCT), also referred to as multislice spiral CT (MSCT), has attracted a major interest since its recent introduction [18], [33]. Compared with single-row-detector systems, MDCT scanners allow faster data collection and thinner slices that support more demanding clinical applications and present new research opportunities. This special issu...
متن کاملExtending Three-Dimensional Weighted Cone Beam Filtered Backprojection (CB-FBP) Algorithm for Image Reconstruction in Volumetric CT at Low Helical Pitches
A three-dimensional (3D) weighted helical cone beam filtered backprojection (CB-FBP) algorithm (namely, original 3D weighted helical CB-FBP algorithm) has already been proposed to reconstruct images from the projection data acquired along a helical trajectory in angular ranges up to [0, 2 π]. However, an overscan is usually employed in the clinic to reconstruct tomographic images with superior ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001